Thev= 0 → 1 vibrational cross-section for e–H2scattering: An unresolved problem with wide implications
نویسندگان
چکیده
منابع مشابه
The v = 0 → 1 vibrational cross-section for e–H2 scattering: An unresolved problem with wide implications
Controversy has surrounded the determination of the v = 0 → 1 vibrational crosssection for e–H2 scattering for some thirty years: differences exist between values measured in crossed-beam experiments, which agree well with ab-initio quantum mechanical values, and cross sections derived from swarm experiments. These differences are far larger than the estimated errors associated with all three d...
متن کاملAn Upper Bound Solution for Analysis of Twist Extrusion Process with Elliptical Die Cross-section
Twist extrusion process is a rather new route to produce highly strained materials. In this process, severe plastic deformation is applied by large shear strains. In current article, required energy for twist extrusion by use of admissible velocity field together with the upper bound technique is predicted. The proposed model is capable of considering the effect of various parameters such as di...
متن کاملInverse limits with subsets of [ 0 , 1 ] cross [ 0 , 1 ]
The characterization of chainable continua as inverse limits on [0, 1] has resulted in many papers which have contributed to our knowledge of both inverse limits and chainable continua. Quite simple maps on [0, 1] give rise to quite complicated inverse limits. In this paper we begin an investigation of continua that can be represented by inverse limits of closed subsets of the unit square I = [...
متن کاملFacets of an Assignment Problem with 0-1 Side Constraint
We show that the problem of finding a perfect matching satisfying a single equality constraint with 0-1 coefficients in an n × n incomplete bipartite graph, polynomially reduces to a special case of the same problem called the partitioned case. Finding a solution matching for the partitioned case in the incomplete bipartite graph, is equivalent to minimizing a partial sum of the variables over ...
متن کاملAn Hybrid Approach for the 0–1 Multi Knapsack Problem
Like for many NP-hard combinatorial optimization problems, both exact and heuristic algorithms have been developed for the MKP01. Existing exact algorithms are essentially based on the branch and bound method [11]. These algorithms are different one from another according to the way the upper bounds are obtained. For instance, in [11], Shih solves, exactly, each of the m single constrained, rel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2007
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/71/1/012004